85A - Domino - CodeForces Solution


constructive algorithms implementation *1300

Please click on ads to support us..

Python Code:

n = int(input())

if n % 2 == 0:
	res1 = 'f'
	res2 = 'f'
	res3 = ""
	res4 = ""
	
	p = 1
	while len(res1) + 1 < n:
		if p % 2:
			res1 = res1 + "aa"
			res2 = res2 + "bb"
		else:
			res1 = res1 + "bb"
			res2 = res2 + "aa"
		p = (p + 1) % 2
		
	while len(res3)  < n:
		if p % 2:
			res3 = res3 + "xx"
			res4 = res4 + "yy"
		else:
			res3 = res3 + "yy"
			res4 = res4 + "xx"
		p = (p + 1) % 2
	
	res1 = res1 + 'o'
	res2 = res2 + 'o'
	
	print(res1, res2, res3, res4, sep='\n')
else:
	res1 = 'f'
	res2 = 'f'
	res3 = ""
	res4 = ""
	
	p = 1
	while len(res1) + 1 < n:
		if p % 2:
			res1 = res1 + "aa"
			res2 = res2 + "bb"
		else:
			res1 = res1 + "bb"
			res2 = res2 + "aa"
		p = (p + 1) % 2
		
	while len(res3) + 1 < n:
		if p % 2:
			res3 = res3 + "xx"
			res4 = res4 + "yy"
		else:
			res3 = res3 + "yy"
			res4 = res4 + "xx"
		p = (p + 1) % 2
	
	res3 = res3 + 'z'
	res4 = res4 + 'z'
	
	print(res1, res2, res3, res4, sep='\n')


Comments

Submit
0 Comments
More Questions

768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal